Coding theory on the generalized balancing sequence
نویسندگان
چکیده
In this paper, we introduce the generalized balancing sequence and its matrix. Then by using matrix, give a coding decoding method.
منابع مشابه
Sequence Coding based on the Fractal Theory
A new scheme for sequence coding based on the iterated functions systems theory is presented. The method relies on a 3D approach in which the sequence is adaptively partitioned. Each partition block can be coded either by using the spatial self similarities or by exploiting temporal redundancies. The proposed system shows very good performances when compared to other existing methods.
متن کاملOn the fine spectra of the generalized difference operator Delta_{uv} over the sequence space c0
The main purpose of this paper is to detemine the fine spectrum of the generalized difference operator Delta_{uv} over the sequence space c0. These results are more general than the fine spectrum of the generalized difference operator Delta_{uv} of Srivastava and Kumar.
متن کاملOn the Properties of Balancing and Lucas-Balancing $p$-Numbers
The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.
متن کاملOn genomic coding theory
This paper gives a brief overview of several applications from the emerging interdisciplinary field of genomic coding theory that aims at applying concepts and techniques from the field of coding theory to problems from the field of molecular biology. This is motivated by the high precision and robustness found in genomic processes in addition to the increase in the availability of genomic data...
متن کاملGeneralized Bezout's theorem and its applications in coding theory
This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more plane curves. A new approach to determine a lower bound on the minimum distance for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notes on Number Theory and Discrete Mathematics
سال: 2023
ISSN: ['1310-5132', '2367-8275']
DOI: https://doi.org/10.7546/nntdm.2023.29.3.503-524